Von Neumann, ville, and the minimax Theorem
نویسندگان
چکیده
Von Neumann proved the minimax theorem (existence of a saddle-point solution to 2 person, zero sum games) in 1928. While his second article on the minimax theorem, stating the proof, has long been translated from German, his first announcement of his result (communicated in French to the Academy of Sciences in Paris by Borel, who had posed the problem settled by Von Neumann’s proof) is translated here for the first time. The proof presented by Von Neumann and Morgenstern (1944) is not Von Neumann’s rather involved proof of 1928, but is based on what they called “The Theorem of the Alternative for Matrices” which is in essence a reformulation of an elegant and elementary result by Borel’s student Jean Ville in 1938. Ville’s argument was the first to bring to light the simplifying role of convexity and to highlight the connection between the existence of minimax and the solvability of systems of linear inequalities. It by-passes nontrivial topological fixed point arguments and allows the treatment of minimax by simpler geometric methods. This approach has inspired a number of seminal contributions in convex analysis including fixed point and coincidence theory for set-valued mappings. Ville’s contributions are discussed briefly and von Neuman’s original communication, Ville’s note, and Borel’s commentary on it are translated here for the first time.
منابع مشابه
A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
The celebrated von Neumann minimax theorem is a fundamental theorem in two-person zero-sum games. In this paper, we present a generalization of the von Neumann minimax theorem, called robust von Neumann minimax theorem, in the face of data uncertainty in the payoff matrix via robust optimization approach. We establish that the robust von Neumann minimax theorem is guaranteed for various classes...
متن کاملOn Borel Probability Measures and Noncooperative Game Theory
In this paper the well-known minimax theorems of Wald, Ville and Von Neumann are generalized under weaker topological conditions on the payoff function f and/or extended to the larger set of the Borel probability measures instead of the set of mixed strategies.
متن کاملGeneralizations of the Nash Equilibrium Theorem in the KKM Theory
The partial KKM principle for an abstract convex space is an abstract form of the classical KKM theorem. In this paper, we derive generalized forms of the Ky Fan minimax inequality, the von Neumann-Sion minimax theorem, the von Neumann-Fan intersection theorem, the Fan-type analytic alternative, and the Nash equilibrium theorem for abstract convex spaces satisfying the partial KKM principle. Th...
متن کاملEquivalent Results in Minimax Theory
In this paper we review known minimax results with applications in game theory and show that these results are easy consequences of the first minimax result for a two person zero sum game with finite strategy sets published by von Neumann in 1928. Among these results are the well known minimax theorems of Wald, Ville and Kneser and their generalizations due to Kakutani, Ky-Fan, König, Neumann a...
متن کاملA very complicated proof of the minimax theorem
The justly celebrated von Neumann minimax theorem has many proofs. Here I reproduce the most complex one I am aware of. This provides a fine didactic example for many courses in convex analysis or functional analysis.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IGTR
دوره 12 شماره
صفحات -
تاریخ انتشار 2010